An algorithm for determining intersection segment-polygon in 3D
نویسندگان
چکیده
ÐIn the ®elds related to geometric modelling, it is fundamental to count on robust. In this work we present a new algorithm for testing the intersection between a segment and a polygon in 3D space. This algorithm is robust and ecient, and it is the basis of most operations developed in geometric modelling. After, we will apply this algorithm to a classic problem in computer graphics: determining the hidden faces of a scene using the ray-casting algorithm. To solve the problem, an objectoriented approach will be used. # 1998 Elsevier Science Ltd. All rights reserved
منابع مشابه
A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملA Recursive Algorithm for Triangulation of Arbitrary Polygon Based on Bsp Tree
Triangulation of polygon is of very importance in three-dimensional software applications. An algorithm for triangulation of polygon based on binary space-partitioning (BSP) tree idea is proposed in this paper. That is, this algorithm implements triangulation of poly-gon with recursive method according to BSP tree structure. It is suitable for not only simple polygons with arbitrary convex or c...
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملمدلسازی روابط توپولوژیک سه بعدی فازی در محیط GIS
Nowadays, geospatial information systems (GIS) are widely used to solve different spatial problems based on various types of fundamental data: spatial, temporal, attribute and topological relations. Topological relations are the most important part of GIS which distinguish it from the other kinds of information technologies. One of the important mechanisms for representing topological relations...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computers & Graphics
دوره 22 شماره
صفحات -
تاریخ انتشار 1998